New type of coding problem motivated by database theory
نویسندگان
چکیده
منابع مشابه
New type of coding problem motivated by database theory
The present paper is intended to survey the interaction between Relational Database Theory and Coding Theory. In particular it is shown how an extremal problem for relational databases gives rise to a new type of coding problem. The former concerns minimal representation of branching dependencies that can be considered as a data mining type question. The extremal configurations involve d-distan...
متن کاملArboricity: An acyclic hypergraph decomposition problem motivated by database theory
The arboricity of a hypergraph H is the minimum number of acyclic hypergraphs that partition H . The determination of the arboricity of hypergraphs is a problem motivated by database theory. The exact arboricity of the complete k-uniform hypergraph of order n is previously known only for k ∈ {1, 2, n − 2, n − 1, n}. The arboricity of the complete k-uniform hypergraph of order n is determined as...
متن کاملsolution of security constrained unit commitment problem by a new multi-objective optimization method
چکیده-پخش بار بهینه به عنوان یکی از ابزار زیر بنایی برای تحلیل سیستم های قدرت پیچیده ،برای مدت طولانی مورد بررسی قرار گرفته است.پخش بار بهینه توابع هدف یک سیستم قدرت از جمله تابع هزینه سوخت ،آلودگی ،تلفات را بهینه می کند،و هم زمان قیود سیستم قدرت را نیز برآورده می کند.در کلی ترین حالتopf یک مساله بهینه سازی غیر خطی ،غیر محدب،مقیاس بزرگ،و ایستا می باشد که می تواند شامل متغیرهای کنترلی پیوسته و گ...
A new type of coding problem
Let X be an n–element finite set, 0 < k < n/2 an integer. Suppose that {A1, B1} and {A2, B2} are pairs of disjoint k-element subsets of X (that is, |A1| = |B1| = |A2| = |B2| = k,A1 ∩ B1 = ∅, A2 ∩ B2 = ∅). Define the distance of these pairs by d({A1, B1}, {A2, B2}) = min{|A1−A2|+ |B1−B2|, |A1−B2|+ |B1−A2|}. It is known ([2]) that this is really a distance on the space of such pairs and that the ...
متن کاملSteganographic Codes -- a New Problem of Coding Theory
— To study how to design steganographic algorithm more efficiently, a new coding problem – steganographic codes (abbreviated stego-codes) – is presented in this paper. The stego-codes are defined over the field with q(q ≥ 2) elements. Firstly a method of constructing linear stego-codes is proposed by using the direct sum of vector subspaces. And then the problem of linear stego-codes is convert...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2004
ISSN: 0166-218X
DOI: 10.1016/j.dam.2004.03.004